Knowledge Based Production Planning and Scheduling

نویسندگان

  • Hans-Jürgen Appelrath
  • Jürgen Sauer
چکیده

One of the topics of the EUREKA project PROTOS (Prolog Tools for Building Expert Systems) [Appelrath 87] is the development of a Prolog-based system that exploits heuristic knowledge for a concrete scheduling application from the chemical industry. The term scheduling designates the problem of chronological allocation of a given set of production orders to the apparatuses available taking into account certain secondary conditions and goals. By the approach pursued in PROTOS Prolog in general and special Prolog tools for the solution of specific production planning and control (PPC) problems are evaluated. Approaches to the scheduling problem suggested so far are mainly based on the conventional operations research methods [Bedworth 87]; first of all they have two shortcomings: High runtime complexity of the algorithms. This problem is due to the combinatorial complexity of the problem domain when practical quantities are involved and when at the same time an optimal solution is demanded. Low flexibility. There are great difficulties to integrate actual, task-specific secondary conditions into already existing, inflexibly implemented procedures. Such conditions are, for example, the knowledge of the production manager about the reasonable sequence of production operations or problem parameters changing at short notice (e.g. the drop-out of resources). Some other approaches try to use knowledge based techniques for scheduling (Fox 84, Kusiak 86, Kusiak 88, Tate 85), but most of the systems lack a user-interface. The approach pursued in PROTOS consists of two parts: 1. Support of the planning activities by a user interface providing both, the relevant information for the planning algorithm, and a 'work space' for manual planning. 2. Knowledge based scheduling: the heuristic knowledge of the production planner is used in order to obtain as good a plan as possible and to enable appropriate reactions to unexpected events. In chapter 1 of this paper the application problem in PROTOS is described. Chapter 2 contains some remarks on the modelling of the problem. The problem solving approach is introduced in chapter 3. In chapter 4 some comments on the first results are given. 1. Scheduling: The PROTOS Application Problem The main tasks of scheduling as a subsection of PPC are the generation and adjustment of a production schedule [Fox 87, Kusiak 88]. A schedule is the chronological allocation of apparatuses to production steps which must be executed in order to produce a product requiring certain conditions to be satisfied. The concrete application considered is scheduling in the chemical industry. The available initial data are a master schedule: It contains a list of orders to be executed for the manufacturing of certain products along with information about amount, start and due dates of the production. Figure 1 shows an example for an extract of a master schedule. Order Product Amount Start date Due date Priority 9S1 6 43200 03 07 89 07 08 89 1 9S1 8 36540 20 02 89 29 03 89 1 9S1 9 50400 02 10 89 05 12 89 1 9S1 10 53600 01 06 89 11 07 89 1 Fig. 1: Master schedule

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

متن کامل

An application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case

Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...

متن کامل

Simultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts

Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...

متن کامل

AI-Based Schedulers in Manufacturing Practice: Report of a Panel Discussion

degree in Mathematics from Westminster College, and M.S. and Ph.D. degrees in Computer Science from the University of Pittsburgh. His research interests include constraint-based planning and scheduling, integration of predictive and reactive decision-making, distributed problem solving, temporal reasoning, machine learning, and knowledge-based production management. He has been a principal arch...

متن کامل

Knowledge-Based Approaches to Scheduling Problems: A Survey

Scheduling is the process of devising or designing a procedure for a particular objective, specifying the sequence or time for each item in the procedure. Qpical scheduling problems are railway time-tabling, project scheduling, production scheduling, and scheduling computer systems as in flexible manufacturing systems and multiprocessor scheduling. Further, there are a number of related problem...

متن کامل

An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990